Sliding window adaptive fast QR and QR-lattice algorithms
نویسندگان
چکیده
منابع مشابه
Sliding window adaptive fast QR and QR-lattice algorithms
Sliding window formulations of the fast QR and fast QR-lattice algorithms are presented. The derivations are based on the partial triangularization of raw data matrices. Three methods for window downdating are discussed: the method of plane hyperbolic rotations, the Chambers’ method, and the LINPACK algorithm. A numerically ill-conditioned stationary signal and a speech signal are used in finit...
متن کاملNew fast QR decomposition least squares adaptive algorithms
This paper presents two new, closely related adaptive algorithms for LS system identification. The starting point for the derivation of the algorithms is the inverse Cholesky factor of the data correlation matrix, obtained via a QR decomposition (QRD). Both algorithms are of O(p) computational complexity, with p being the order of the system. The first algorithm is a fixed order QRD scheme with...
متن کاملFast QR based IIR adaptive filtering algorithm
In this paper, we present a new QR based algorithm for IIR adaptive filtering. This algorithm achieves a reduction of complexity with regard to the IIR-QR algorithm by using a block reduction transformation. Moreover, this new approach make it possible to directly transform fast FIR algorithm into fast O (N) versions of the IIR algorithm. Therefore, we derive a fast version of the algorithm fro...
متن کاملFast Moving Window Algorithm for QR and Cholesky Decompositions
This paper proposes a fast moving window algorithm for QR and Cholesky decompositions by simultaneously applying data updating and downdating. The developed procedure is based on inner products and entails a similar downdating to that of the Chambers’ approach. For adding and deleting one row of data from the original matrix, a detailed analysis shows that the proposed algorithm outperforms exi...
متن کاملLattice and QR Decomposition-Based Algorithms for Recursive Least Squares Adaptive Nonlinear Filters*
This paper presents a lattice structure for adaptive Volterra systems. The stucture is applicable to arbitrary planes of support of the Volterra kernels. A fast least squares lattice and a fast QR-lattice adaptive nonlinear filtering algorithms based on the lattice structure are also presented. These algorithms share the fast convergence property of fast least squares transversal Volterra filte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 1998
ISSN: 1053-587X
DOI: 10.1109/78.726802